TSTP Solution File: ITP246^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP246^1 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:48 EDT 2024
% Result : Theorem 36.51s 13.93s
% Output : CNFRefutation 36.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 20
% Syntax : Number of formulae : 34 ( 16 unt; 14 typ; 0 def)
% Number of atoms : 28 ( 13 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 160 ( 11 ~; 8 |; 0 &; 141 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
num: $tType ).
thf(decl_277,type,
one_one_nat: nat ).
thf(decl_462,type,
suc: nat > nat ).
thf(decl_527,type,
bit0: num > num ).
thf(decl_529,type,
one: num ).
thf(decl_537,type,
numeral_numeral_nat: num > nat ).
thf(decl_593,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_711,type,
divide_divide_nat: nat > nat > nat ).
thf(decl_842,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_903,type,
deg: nat ).
thf(decl_908,type,
na: nat ).
thf(decl_913,type,
xa: nat ).
thf(decl_914,type,
za: nat ).
thf(fact_49_verit__la__disequality,axiom,
! [X36: nat,X37: nat] :
( ( X36 = X37 )
| ~ ( ord_less_eq_nat @ X36 @ X37 )
| ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
file('/export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p',fact_49_verit__la__disequality) ).
thf(fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
file('/export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p',fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).
thf(fact_335_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p',fact_335_Suc__1) ).
thf(conj_0,conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p',conj_0) ).
thf(fact_0_bbbb,axiom,
ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p',fact_0_bbbb) ).
thf(fact_2_aaaa,axiom,
ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p',fact_2_aaaa) ).
thf(c_0_6,plain,
! [X36: nat,X37: nat] :
( ( X36 = X37 )
| ~ ( ord_less_eq_nat @ X36 @ X37 )
| ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
inference(fof_simplification,[status(thm)],[fact_49_verit__la__disequality]) ).
thf(c_0_7,plain,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
inference(split_conjunct,[status(thm)],[fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).
thf(c_0_8,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_335_Suc__1]) ).
thf(c_0_9,negated_conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
!= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_10,plain,
! [X28209: nat,X28210: nat] :
( ( X28209 = X28210 )
| ~ ( ord_less_eq_nat @ X28209 @ X28210 )
| ~ ( ord_less_eq_nat @ X28210 @ X28209 ) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_0_bbbb]) ).
thf(c_0_12,plain,
( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
= na ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_13,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_aaaa]) ).
thf(c_0_14,negated_conjecture,
( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
!= ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X3: nat,X2: nat] :
( ( X2 = X3 )
| ~ ( ord_less_eq_nat @ X2 @ X3 )
| ~ ( ord_less_eq_nat @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ na ) @ ( vEBT_VEBT_high @ xa @ na ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8]),c_0_12]),c_0_8]),c_0_12]) ).
thf(c_0_17,plain,
ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_VEBT_high @ za @ na ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_8]),c_0_12]),c_0_8]),c_0_12]) ).
thf(c_0_18,negated_conjecture,
( ( vEBT_VEBT_high @ za @ na )
!= ( vEBT_VEBT_high @ xa @ na ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7]),c_0_7]) ).
thf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.43/2.49 % Problem : ITP246^1 : TPTP v8.1.2. Released v8.1.0.
% 2.43/2.50 % Command : run_E %s %d THM
% 2.50/2.71 % Computer : n019.cluster.edu
% 2.50/2.71 % Model : x86_64 x86_64
% 2.50/2.71 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.50/2.71 % Memory : 8042.1875MB
% 2.50/2.71 % OS : Linux 3.10.0-693.el7.x86_64
% 2.50/2.71 % CPULimit : 300
% 2.50/2.71 % WCLimit : 300
% 2.50/2.71 % DateTime : Fri May 3 12:27:31 EDT 2024
% 2.50/2.71 % CPUTime :
% 5.18/5.39 Running higher-order theorem proving
% 5.18/5.39 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.xExsGNzVeQ/E---3.1_26325.p
% 36.51/13.93 # Version: 3.1.0-ho
% 36.51/13.93 # partial match(1): HMLMSMSMSSLCHFA
% 36.51/13.93 # Preprocessing class: HMLMSMLMSSLCHFA.
% 36.51/13.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.51/13.93 # Starting new_ho_10 with 1500s (5) cores
% 36.51/13.93 # Starting sh5l with 300s (1) cores
% 36.51/13.93 # Starting new_bool_1 with 300s (1) cores
% 36.51/13.93 # Starting new_bool_2 with 300s (1) cores
% 36.51/13.93 # new_bool_2 with pid 26408 completed with status 0
% 36.51/13.93 # Result found by new_bool_2
% 36.51/13.93 # partial match(1): HMLMSMSMSSLCHFA
% 36.51/13.93 # Preprocessing class: HMLMSMLMSSLCHFA.
% 36.51/13.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.51/13.93 # Starting new_ho_10 with 1500s (5) cores
% 36.51/13.93 # Starting sh5l with 300s (1) cores
% 36.51/13.93 # Starting new_bool_1 with 300s (1) cores
% 36.51/13.93 # Starting new_bool_2 with 300s (1) cores
% 36.51/13.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.51/13.93 # Search class: HGHSM-SMLM32-DHFFFSBN
% 36.51/13.93 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 36.51/13.93 # Starting new_ho_10 with 181s (1) cores
% 36.51/13.93 # new_ho_10 with pid 26409 completed with status 0
% 36.51/13.93 # Result found by new_ho_10
% 36.51/13.93 # partial match(1): HMLMSMSMSSLCHFA
% 36.51/13.93 # Preprocessing class: HMLMSMLMSSLCHFA.
% 36.51/13.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.51/13.93 # Starting new_ho_10 with 1500s (5) cores
% 36.51/13.93 # Starting sh5l with 300s (1) cores
% 36.51/13.93 # Starting new_bool_1 with 300s (1) cores
% 36.51/13.93 # Starting new_bool_2 with 300s (1) cores
% 36.51/13.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.51/13.93 # Search class: HGHSM-SMLM32-DHFFFSBN
% 36.51/13.93 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 36.51/13.93 # Starting new_ho_10 with 181s (1) cores
% 36.51/13.93 # Preprocessing time : 0.281 s
% 36.51/13.93 # Presaturation interreduction done
% 36.51/13.93
% 36.51/13.93 # Proof found!
% 36.51/13.93 # SZS status Theorem
% 36.51/13.93 # SZS output start CNFRefutation
% See solution above
% 36.51/13.93 # Parsed axioms : 11234
% 36.51/13.93 # Removed by relevancy pruning/SinE : 7424
% 36.51/13.93 # Initial clauses : 9458
% 36.51/13.93 # Removed in clause preprocessing : 1911
% 36.51/13.93 # Initial clauses in saturation : 7547
% 36.51/13.93 # Processed clauses : 9616
% 36.51/13.93 # ...of these trivial : 327
% 36.51/13.93 # ...subsumed : 2060
% 36.51/13.93 # ...remaining for further processing : 7229
% 36.51/13.93 # Other redundant clauses eliminated : 1532
% 36.51/13.93 # Clauses deleted for lack of memory : 0
% 36.51/13.93 # Backward-subsumed : 58
% 36.51/13.93 # Backward-rewritten : 91
% 36.51/13.93 # Generated clauses : 4145
% 36.51/13.93 # ...of the previous two non-redundant : 2771
% 36.51/13.93 # ...aggressively subsumed : 0
% 36.51/13.93 # Contextual simplify-reflections : 112
% 36.51/13.93 # Paramodulations : 2828
% 36.51/13.93 # Factorizations : 0
% 36.51/13.93 # NegExts : 0
% 36.51/13.93 # Equation resolutions : 1557
% 36.51/13.93 # Disequality decompositions : 0
% 36.51/13.93 # Total rewrite steps : 6360
% 36.51/13.93 # ...of those cached : 5507
% 36.51/13.93 # Propositional unsat checks : 0
% 36.51/13.93 # Propositional check models : 0
% 36.51/13.93 # Propositional check unsatisfiable : 0
% 36.51/13.93 # Propositional clauses : 0
% 36.51/13.93 # Propositional clauses after purity: 0
% 36.51/13.93 # Propositional unsat core size : 0
% 36.51/13.93 # Propositional preprocessing time : 0.000
% 36.51/13.93 # Propositional encoding time : 0.000
% 36.51/13.93 # Propositional solver time : 0.000
% 36.51/13.93 # Success case prop preproc time : 0.000
% 36.51/13.93 # Success case prop encoding time : 0.000
% 36.51/13.93 # Success case prop solver time : 0.000
% 36.51/13.93 # Current number of processed clauses : 961
% 36.51/13.93 # Positive orientable unit clauses : 426
% 36.51/13.93 # Positive unorientable unit clauses: 12
% 36.51/13.93 # Negative unit clauses : 209
% 36.51/13.93 # Non-unit-clauses : 314
% 36.51/13.93 # Current number of unprocessed clauses: 5719
% 36.51/13.93 # ...number of literals in the above : 19638
% 36.51/13.93 # Current number of archived formulas : 0
% 36.51/13.93 # Current number of archived clauses : 5190
% 36.51/13.93 # Clause-clause subsumption calls (NU) : 15817892
% 36.51/13.93 # Rec. Clause-clause subsumption calls : 1358675
% 36.51/13.93 # Non-unit clause-clause subsumptions : 1722
% 36.51/13.93 # Unit Clause-clause subsumption calls : 60042
% 36.51/13.93 # Rewrite failures with RHS unbound : 0
% 36.51/13.93 # BW rewrite match attempts : 1205
% 36.51/13.93 # BW rewrite match successes : 426
% 36.51/13.93 # Condensation attempts : 9616
% 36.51/13.93 # Condensation successes : 36
% 36.51/13.93 # Termbank termtop insertions : 2831192
% 36.51/13.93 # Search garbage collected termcells : 175950
% 36.51/13.93
% 36.51/13.93 # -------------------------------------------------
% 36.51/13.93 # User time : 7.477 s
% 36.51/13.93 # System time : 0.115 s
% 36.51/13.93 # Total time : 7.592 s
% 36.51/13.93 # Maximum resident set size: 45640 pages
% 36.51/13.93
% 36.51/13.93 # -------------------------------------------------
% 36.51/13.93 # User time : 8.262 s
% 36.51/13.93 # System time : 0.143 s
% 36.51/13.93 # Total time : 8.405 s
% 36.51/13.93 # Maximum resident set size: 25116 pages
% 36.51/13.93 % E---3.1 exiting
% 36.51/13.94 % E exiting
%------------------------------------------------------------------------------